Java program to find all pairs of elements in an array whose sum is equal to a given number.

Question

Ravi Vishwakarma · Answer

Here's a step-by-step implementation in Java:
Initialize a HashSet to store the elements we encounter.Iterate through the array and for each element, calculate the complement that would sum to the target value.Check if the complement exists in the HashSet. If it does, print the pair.Add the current element to the HashSet.
Code Example:
import java.util.*;
public class Main {
 public static void findPairs(int[] array, int sum) {
 // Create a HashSet to store elements
 HashSetandlt;Integer> seen = new HashSetandlt;>();
 System.out.println("Pairs with sum " + sum + ":");
 // Iterate through each element in the array
 for (int num : array) {
 // Calculate the complement
 int complement = sum - num;
 // Check if the complement is in the HashSet
 if (seen.contains(complement)) {
 System.out.println("(" + complement + ", " + num + ")");
 }
 // Add the current element to the HashSet
 seen.add(num);
 }
 }
 public static void main(String[] args) {
 int[] array = {1, 4, 5, 7, 3, 9, 2, 10, 0};
 int sum = 10;
 findPairs(array, sum);
 }
}
Output,
and

interview

Java program to find all pairs of elements in an array whose sum is equal to a given number.

Ravi Vishwakarma

1 Answers

Liked By